Compiling ATL with Continuations
نویسندگان
چکیده
This paper presents a proposal to use continuations as an implementation mechanism for ATL. We introduce the notion of continuation, showing its applicability to model-to-model transformations, and develop a simple mechanism to enable continuations in model transformations. Then, the declarative part of ATL is mapped to this mechanism.
منابع مشابه
Compiling with Continuations
Cambridge University Press has no responsibility for the persistence or accuracy of URLs for external or third-party Internet websites referred to in this publication, and does not guarantee that any content on such websites is, or will remain, accurate or appropriate.
متن کاملATL: Eclipse Support for Model Transformation
In the context of Model Driven Engineering models are the main development artifacts and model transformations are among the most important operations applied to models. A number of specialized languages have been proposed, aimed at specifying model transformations. Apart from the software engineering properties of transformation languages the availability of high quality tool support is also o...
متن کاملATL: A model transformation tool
In the context of Model Driven Engineering, models are the main development artifacts and model transformations are among the most important operations applied to models. A number of specialized languages have been proposed, aimed at specifying model transformations. Apart from the software engineering properties of transformation languages, the availability of high quality tool support is also...
متن کاملCompiling with continuations
This paper describes the Orbit Scheme optimizing compiler. Orbit was one of the first practical compilers for Scheme, whereas most existing Scheme compilers at the time were research prototypes. The paper walks us through the phases of the compiler, explaining design decisions along the way. The result of this research is a production-quality Scheme compiler. It generates code that is competiti...
متن کاملTurning Game Models Turn-Based for Model Checking Properties of Agents
ATL is a logic for open computational systems; ATL model checking is known to be linear in the size of models. We have already pointed out in another paper that the size of an ATL model is usually exponential in the number of processes (or agents), and we showed that the problem for ATL semantics based on alternating transition systems is NP-complete when the number of agents is considered a pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011